Method, system and software product for color image encoding

ABSTRACT

The present invention relates to the compression of color image data. A combination of hard decision pixel mapping and soft decision pixel mapping is used to jointly address both quantization distortion and compression rate while maintaining low computational complexity and compatibility with standard decoders, such as, for example, the GIF/PNG decoder.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a divisional of application Ser. No. 10/831,656, filed on Apr. 23, 2004, entitled: METHOD, SYSTEM AND SOFTWARE PRODUCT FOR COLOR IMAGE ENCODING, the contents of which are herein incorporated by reference.

FIELD OF THE INVENTION

The present invention relates to a method, system and software product for color image encoding.

BACKGROUND OF THE INVENTION

In recent years, the volume of color image data on the Internet has been explosively increasing. In particular, due to the increasing popularity of web sites, digital cameras, and online games, color image data have become a significant portion of the Internet traffic. On the other hand, access to color images through wireless channels or via low power, small devices is still time-consuming and inconvenient, which is mainly due to the limitations of image display device, storage, and transmission bandwidth has become a bottleneck for many multimedia applications—see, for example, J. Barrilleaux, R. Hinkle, and S. Wells, “Efficient vector quantization for color image encoding,” Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP 87, vol. 12, pp. 740-743, April 1987 (hereinafter “reference [1]”), M. T. Orchard and C. A. Bouman, “Color quantization of images,” Signal Processing, IEEE Transactions on, vol. 39, no. 12, pp. 2677-2690, December 1991 (hereinafter “reference [2]”), 1. Ashdown, “Octree color quantization,” C/C++ Users Journal, vol. 13, no. 3, pp. 31-43, 1994 (hereinafter “reference [3]”), X. Wu, “Yiq vector quantization in a new color palette architecture,” IEEE Trans. on Image Processing, vol. 5, no. 2, pp. 321-329, 1996 (hereinafter “reference [4]”), L. Velho, J. Gomes, and M. V. R. Sobreiro, “Color image quantization by pairwise clustering,” Proc. Tenth Brazilian Symp. Comput Graph. Image Process., L. H. de Figueiredo and M. L. Netto, Eds. Campos do Jordao, Spain, pp. 203-210, 1997 (hereinafter “reference [5]”) and S. Wan, P. Prusinkiewicz, and S. Wong, “Variance-based color image quantization for frame buffer display,” Res. Appl., vol. 15, pp. 52-58, 1990 (hereinafter “reference [6]”).

One way to alleviate the above limitations is to apply efficient color image encoding schemes which compress, optimize, or re-encode color images. A typical color image encoding scheme consists of a color palette, pixel mapping, and lossless code. The color palette acts as a vector quantization codebook, and is used to represent all colors in the original color image. The pixel mapping then maps each pixel in the image into an index corresponding to a color in the color palette. The pixel mapping could be either a hard decision pixel mapping for which the quantization of a RGB color vector into a color of the color palette is fixed and independent of the pixel location of the RGB color vector in the image once the color palette is given, or a soft decision pixel mapping for which a RGB color vector may be quantized into different colors of the color palette at different pixel locations. The index sequence resulting from the pixel mapping is finally encoded by a lossless code.

Previously, color palette design, pixel mapping, and coding were investigated separately. In the design of color palette and pixel mapping, the coding part is often ignored and the main objective is to reduce the quantization distortion, improve visual quality of quantized images, and decrease computational complexity. Several tree-structured splitting and merging color image quantization methods are proposed in the literature—see, for example, references [1] to [6]—to achieve, more or less, this objective.

On the other hand, when coding is concerned, the color palette and pixel mapping are often assumed to be given, and the objective is to design efficient codes for the index sequence so as to reduce the compression rate. For instance, an algorithm for lossy compression in the LUV color space of color-quantized images was given in A. Zaccarin and B. Liu, “A novel approach for coding color quantized image,” Image Processing, IEEE Transactions on, vol. 2, no. 4, pp. 442-453, October 1993 (hereinafter “reference [7]”). Two heuristic solutions were proposed in N. D. Memon and A. Venkateswaran, “On ordering color maps for lossless predictive coding,” IEEE Transactions on Image Processing, vol. 5, no. 11, pp. 1522-1527, 1996 (hereinafter “reference [8]”), to reorder color maps prior to encoding the image by lossless predictive coding techniques. Based on a binary-tree structure and context-based entropy coding, a compression algorithm was proposed in X. Chen, S. Kwong, and J. fu Feng, “A new compression scheme for color-quantized images,” Circuits and Systems for Video Technology, IEEE Transactions on, vol. 12, no. 10, pp. 904-908, October 2002 (hereinafter “reference [9]”) to provide progressive coding of color-quantized images. In these algorithms, the compression efficiency is achieved at the expense of compressed bit streams incompatible with standard decoders such as the GIF/PNG decoder.

SUMMARY OF THE INVENTION

In accordance with a first aspect of the present invention, there is provided a method for creating, from a digitized color image with N distinct colors using a data processing system, a tree structured partitioning of all pixels in the digitized color image into M disjoint clusters, wherein M is less than or equal to N, each color in the N distinct colors is digitally represented by a plurality of P-bit bytes in a color palette, and the P-bits in each P-bit byte are ordered from most significant to least significant. The method comprises (a) providing a root node comprising all of the N distinct colors; (b) providing a first level of sibling nodes linked to the root node, wherein each color in the N distinct colors is allocated by the data processing system to an associated node in the first level of sibling nodes based on a value of a first bit in each P-bit byte in the plurality of P-bit bytes; (c) for each node in a k^(th) level of nodes comprising more than one color, providing a plurality of sibling nodes at a (k+1)^(th) level, wherein each color in that node is allocated by the data processing system to an associated sibling node in the plurality of sibling nodes at the (k+1)^(th) level based on a value of a (k+1)^(th) bit in each P-bit byte in the plurality of P-bit bytes for that color, such that for each color in the N distinct colors there is a distinct leaf node comprising that color alone; and (d) selecting and merging leaf nodes until there are only M leaf nodes left.

In accordance with a second aspect of the present invention, there is provided a data processing system for creating, from a digitized color image with N distinct colors, a tree structured partitioning of all pixels in the digitized color image into M disjoint clusters, wherein M is less than or equal to N, each color in the N distinct colors is digitally represented by a plurality of P-bit bytes in a color palette, and the P-bits in each P-bit byte are ordered from most significant to least significant. The data processing system comprises: (a) node-creation means for (i) providing a root node comprising all of the N distinct colors; (ii) providing a first level of sibling nodes linked to the root node, wherein each color in the N distinct colors is allocated to an associated node in the first level of sibling nodes based on a value of a first bit in each P-bit byte in the plurality of P-bit bytes; and (iii) for each node in a k^(th) level of nodes comprising more than one color, providing a plurality of sibling nodes at a (k+1)^(th) level, wherein each color in that node is allocated to an associated sibling node in the plurality of sibling nodes at the (k+1)^(th) level based on a value of a (k+1)^(th) bit in each P-bit byte in the plurality of P-bit bytes for that color, such that for each color in the N distinct colors there is a distinct leaf node comprising that color alone; and (b) node merging means for selecting and merging leaf nodes until there are only M leaf nodes left.

In accordance with a third aspect of the present invention, there is provided a computer program product for use on a computer system to create, from a digitized color image with N distinct colors, a tree structured partitioning of all pixels in the digitized color image into M disjoint clusters, wherein M is less than or equal to N, each color in the N distinct colors is digitally represented by a plurality of P-bit bytes in a color palette, and the P-bits in each P-bit byte are ordered from most significant to least significant. The computer program product comprises a recording medium; means recorded on the medium for instructing the computer system to perform the steps of: (a) providing a root node comprising all of the N distinct colors; (b) providing a first level of sibling nodes linked to the root node, wherein each color in the N distinct colors is allocated to an associated node in the first level of sibling nodes based on a value of a first bit in each P-bit byte in the plurality of P-bit bytes; (c) for each node in a k^(th) level of nodes comprising more than one color, providing a plurality of sibling nodes at a (k+1)^(th) level, wherein each color in that node is allocated to an associated sibling node in the plurality of sibling nodes at the (k+1)^(th) level based on a value of a (k+1)^(th) bit in each P-bit byte in the plurality of P-bit bytes for that color, such that for each color in the N distinct colors there is a distinct leaf node comprising that color alone; and (d) selecting and merging leaf nodes until there are only M leaf nodes left.

In accordance with a fourth aspect of the present invention, there is provided a method for deriving a new index sequence representing a pixel mapping and a new output function representing a color palette for a new digitized color image derived from an original digitized color image both defined on n pixels, wherein the original digitized color image is provided by N distinct colors being allocated to the n pixels, the new digitized color image is provided by M distinct colors being allocated to the n pixels, the new index sequence has n index members for representing the n pixels and the new output function is for mapping the n index members to the M colors. The method comprises (a) providing a first new index sequence by partitioning all pixels in the original digitized color image into M disjoint clusters based on a color of each pixel in the original digitized color image without regard to the location of the pixel in the original digitized color image, wherein M is less than or equal to N; (b) providing a first new output function for providing a one-to-one mapping of the M distinct colors onto the pixels in the M disjoint clusters; (c) applying a soft decision optimization process to the first new index sequence and the first new output function to provide the new index sequence and the new output function respectively based on, for each member of the first new index sequence, how a color value assigned to that member by the first new output function correlates with the color value assigned to at least one other member of the first new index sequence by the first new output function.

In accordance with a fifth aspect of the present invention, there is provided a data processing system for deriving a new index sequence representing a pixel mapping and a new output function representing a color palette for a new digitized color image derived from an original digitized color image both defined on n pixels, wherein the original digitized color image is provided by N distinct colors being allocated to the n pixels, the new digitized color image is provided by M distinct colors being allocated to the n pixels, the new index sequence has n index members for representing the n pixels and the new output function is for mapping the n index members to the M colors. The data processing system comprises (a) a hard decision module for (i) providing a first new index sequence by partitioning all pixels in the original digitized color image into M disjoint clusters based on a color of each pixel in the original digitized color image without regard to the location of the pixel in the original digitized color image, wherein M is less than or equal to N, and (ii) providing a first new output function for providing a one-to-one mapping of the M distinct colors onto the pixels in the M disjoint clusters; and, (b) a soft decision module for applying a soft decision optimization process to the first new index sequence and the first new output function to provide the new index sequence and the new output function respectively based on, for each member of the first new index sequence, how a color value assigned to that member by the first new output function correlates with the color value assigned to at least one other member of the first new index sequence by the first new output function.

In accordance with a sixth aspect of the present invention, there is provided a computer program product for use on a computer system to create a pixel mapping and a new output function representing a color palette for a new digitized color image derived from an original digitized color image both defined on n pixels, wherein the original digitized color image is provided by N distinct colors being allocated to the n pixels, the new digitized color image is provided by M distinct colors being allocated to the n pixels, the new index sequence has n index members for representing the n pixels and the new output function is for mapping the n index members to the M colors. The computer program product comprises a recording medium; and, means recorded on the medium for instructing the computer system to perform the steps of: (a) providing a first new index sequence by partitioning all pixels in the original digitized color image into M disjoint clusters based on a color of each pixel in the original digitized color image without regard to the location of the pixel in the original digitized color image, wherein M is less than or equal to N; (b) providing a first new output function for providing a one-to-one mapping of the M distinct colors onto the pixels in the M disjoint clusters; (c) applying a soft decision optimization process to the first new index sequence and the first new output function to provide the new index sequence and the new output function respectively based on, for each member of the first new index sequence, how a color value assigned to that member by the first new output function correlates with the color value assigned to at least one other member of the first new index sequence by the first new output function.

BRIEF DESCRIPTION OF THE DRAWINGS

A detailed description of preferred aspects of the invention is provided herein below with reference to the following drawings, in which:

FIG. 1, in a block diagram, illustrates a computer system in accordance with a preferred aspect of the present invention;

FIG. 2, in a graph, illustrates a octree structure in accordance with a preferred aspect of the invention;

FIG. 3, in a graph, illustrates a Viterbi algorithm in accordance with a first variant of a soft-decision optimization aspect of the present invention;

FIG. 4, in a graph, illustrates a Viterbi algorithm in accordance with a second variant of a soft-decision optimization aspect of the present invention; and,

FIG. 5, in a block diagram, illustrates a CPU of the computer system of FIG. 1.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION

Referring to FIG. 1, there is illustrated in a block diagram, a computer system 10 in accordance with an aspect of the invention. The computer system comprises a memory 12 for storing color image data, a monitor 14 for displaying digital color images, a CPU 16 for image processing and for providing compression of color data that jointly optimizes both quantization, distortion and compression weight while maintaining low computational complexity and compatibility with GIF/PNG decoders, and an encoder 20 such as a GIF encoder or PNG encoder for encoding the color image data prior to its transmission from the computer system 10 via transmission conduit 20.

The joint optimization problem of color image encoding can be defined as follows: Let Ω={(r,g,b)|0≦r,g,b≦255} be the RGB color space. Assume O={o₀, o₁, . . . , o_(N−1)} is the color palette of an original color image which has N distinct colors. If the total number of pixels in the original image is n, we obtain an index sequence I=(i₀, i₁, . . . , i_(n−1)) by scanning the color image from top to bottom and from left to right, where i_(k) means that the color vector of the k^(th) pixel is o_(i) _(k) . If we confine ourselves to using a new color palette C with M colors (M<N) to reproduce the original color image, the joint optimization encoder is aimed at finding a new color palette C={c₀, c₁, . . . , c_(M−1)}, a new index sequence U=(u₀, u₁, . . . , u_(n−1)), and a lossless codeword length function I to reproduce the original image and to minimize the cost function:

${n^{- 1}{l(U)}} + {\lambda \; n^{- 1}{\sum\limits_{k = 0}^{n - 1}{d\left( {o_{i_{k}},c_{u_{k}}} \right)}}}$

where λ is a Lagrangian multiplier, and d is the square error incurred by representing o_(i) _(k) by c_(u) _(k:)

d(o _(i) ,c _(k))=∥o _(i) −c _(k)∥²=(r _(o) _(i) −r _(c) _(k) )²+(g _(o) _(i) −g _(c) _(k) )²+(b _(o) _(i) −b _(c) _(k) )²  (1.1)

Since there is a one-to-one mapping between a lossless codeword length function and a lossless code, selection of a lossless codeword length function is equivalent to that of a lossless code.

Clearly

$\begin{matrix} {{\sum\limits_{k = 0}^{n - 1}{d\left( {o_{i_{k}},c_{u_{k}}} \right)}} = {\sum\limits_{k = 0}^{n - 1}\begin{bmatrix} {\left( {r_{o_{i_{k}}} - r_{c_{u_{k}}}} \right)^{2} + \left( {g_{o_{i_{k}}} - g_{c_{u_{k}}}} \right)^{2} +} \\ \left( {b_{o_{i_{k}}} - b_{c_{u_{k}}}} \right)^{2} \end{bmatrix}}} & (1.2) \end{matrix}$

is the total square error (TSE), which is closely related with the visual quality of the quantized color images. Note that the minimization of TSE or other similar distortion measures is the sole purpose of quantization-oriented methods considered in references [1] to [6]. Similarly, given the new color palette C and pixel mapping (hence the index sequence U), the minimization of bit rate n⁻¹l(U) among all possible lossless codeword length functions l is the sole purpose of coding methods for color-quantized images considered in references [7] to [9]. The cost function given above brings forward the problem of joint optimization of the rate and distortion. The quantization distortion is determined by the color palette C and pixel mapping (i.e., the index sequence U); the compression rate is determined by both the pixel mapping and the lossless codeword length function l. Here, of course, the pixel mapping is a soft decision pixel mapping. Therefore, even if the lossless codeword length function l is fixed, one can still jointly optimize both the rate and distortion by changing both C and U.

There are many lossless codeword length functions, each corresponding to a different entropy code, such as Huffman codes D. A. Huffman, “A method for the construction of minimum-redundancy codes,” Proc. IRE, vol. 40, no. 9, pp. 1098-1101, 1952 (hereinafter “reference [12]”), Lempel-ziv codes J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. On Information Theory, vol. 23, pp. 337-343, 1977 (hereinafter “reference [11]”), J. Ziv and A. Lempel IEEE Trans. Inform. Theory (hereinafter “reference [10]”), arithmetic codes I. H. Witten, M. Neal, and J. G. Cleary, “Arithmetic coding for data compression,” Commun. ACM, vol. 30, pp. 520-540, June 1987 (hereinafter “reference [13]”), grammar-based codes, E.-H. Yang and J. C. Kieffer, “Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform—part one: Without context models,” IEEE Trans. On Information Theory, vol. 46, no. 3, pp. 755-777, May 2000 (hereinafter “reference [14]”), J. C. Kieffer and E.-H. Yang, “Grammar based codes: A new class of universal lossless source codes,” IEEE Trans. on Information Theory, vol. 46, no. 3, pp. 737-754, May 2000 (hereinafter “reference [15]”), E.-H. Yang and D.-K. He IEEE Trans. on Information Theory, vol. 49, pp. 2874-2894, 2003 (hereinafter “reference [16]”), and lossless codes designed specifically for color image encoding—see references [7] to [9]. Since we want to maintain compatibility with GIF/PNG decoder, we choose l to be the codeword length of LZ78 or its variant in the case of GIF decoder and of the LZ77 code or its variant in the case of PNG decoder, J. Miano, “Compressed image file formats: Jpeg, png, gif, xbm, bmp,” ACM Press, 2000 (hereinafter “reference [17]”), which will be denoted in each case simply by l_(LZ)(U). Therefore, the cost function to be minimized in our case is

${n^{- 1}{l_{LZ}(U)}} + {\lambda \; n^{- 1}{\sum\limits_{k = 0}^{n - 1}{{d\left( {o_{i_{k}},c_{u_{k}}} \right)}.}}}$

The cost function given above is of form similar to the cost function defined in entropy-constrained vector quantization (ECVQ), P. A. Chou, T. Lookabaugh, and R. M. Gray, “Entropy-constrained vector quantization,” Acoustics, Speech, and Signal Processing [see also IEEE Transactions on Signal Processing], IEEE Transactions on, vol. 37, no. 1, pp. 31-42, January 1989 (hereinafter “reference [18]”), and in particular to the cost function defined in variable-rate trellis source encoding (VRTSE), E.-H. Yang and Z. Zhang, “Variable rate trellis source encoding,” IEEE Trans. on Information Theory, vol. 45, no. 2, pp. 586-608, March 1999 (hereinafter “reference [19]”). VRTSE can be viewed as a generalization of entropy-constrained scalar quantization and vector quantization [18] in the sense that it makes use of trellis structure and jointly optimizes the resulting rate, distortion, and selected encoding path. Its efficient performance, especially in low rate regions, makes VRTSE particularly applicable to color image encoding where a high compression ratio is often desired for saving storage space and transmission time.

Based on VRTSE, we have developed two methods in accordance with an aspect of the invention, variable-rate trellis color quantization (VRTCQ) 1 and VRTCQ 2, to jointly optimize both the quantization distortion and compression rate while maintaining low computational complexity and compatibility with GIF/PNG decoder. Both VRTCQ 1 and VRTCQ 2 use a soft decision pixel mapping, and are iterative. In addition, in accordance with a further aspect of the invention, entropy-constrained hierarchical merging quantization (ECHMQ), which uses the octree data structure for RGB colors and locally minimizes an entropy-constrained cost for the quantized color image, is developed to provide an initial color image encoding scheme for VRTCQ 1 and VRTCQ 2. On its own, ECHMQ provides an efficient way to trade off the rate and distortion of the quantized color image.

Brief Review of Variable-Rate Trellis Source Encoding

Variable-rate trellis source encoding presented in [19] is an extension of fixed slope lossy coding, E. H. Yang, Z. Zhang, and T. Berger, “Fixed-slope universal lossy data compression,” IEEE Trans. on Information Theory, vol. 43, no. 5, pp. 1465-1476, September 1997 (hereinafter “reference [20]”), to the case of trellis-structured decoders. For each real-valued source sequence x^(n)=(x₀, x₁, . . . , x_(n−1))εR^(n), it aims to find a sequence u^(n)=(u₀, u₁, . . . , u_(n−1))εM_(set) ^(n), M_(set)={0, 1, . . . , M−1}, to minimize the cost function

J(x ^(n))=n ⁻¹ l(u ^(n))+λn ⁻¹ p(x ^(n),β(u ^(n)))

where λ is a given Lagrangian multiplier, l is a lossless codeword length function, β(u^(n))=(z₀, z₁, . . . , z_(n−1)) is the reproduction sequence corresponding to u^(n), and p is the square error distortion defined by

${p\left( {x^{n},z^{n}} \right)}\underset{\_}{\underset{\_}{\Delta}}{\sum\limits_{i = 0}^{n - 1}{{p\left( {x_{i},z_{i}} \right)}\underset{\_}{\underset{\_}{\Delta}}{\sum\limits_{0}^{n - 1}\left( {x_{i},z_{i}} \right)^{2}}}}$

for any x^(n)=(x₀, x₁, . . . , x_(n−1)) and z^(n)=(z₀, z₁, . . . , z_(n−1)).

The reproduction sequence β(u^(n)) is determined from u^(n) through a trellis-structured decoder β=(f,g), where f:S×M_(set)→S is a state transition function, S={s₀, s₁, . . . , s_(|S|−1)} is a set of states, and g:S×M_(set)→R is an output function. The functions f and g determine the trellis structure and the set of reproduction levels (similar to a color palette), respectively. Given an initial state s_(i) _(o) , the reproduction sequence β(u^(n))=(z₀, z₁, . . . , z_(n−1)) is computed as follows:

$\begin{matrix} {{z_{j} = {g\left( {s_{i_{j}},u_{j}} \right)}}{s_{i_{j + 1}} = {f\left( {s_{i_{j}},u_{j}} \right)}}{{j = 0},1,\ldots \mspace{14mu},{n - 1}}} & (2.3) \end{matrix}$

In other words, upon receiving u^(n), the decoder β outputs the reproduction sequence β(u^(n))=(z₀, z₁, . . . , z_(n−1),) while traversing the sequence of states s_(i) ₀ , s_(i) ₁ , . . . , s_(i) _(n) .

Fix β. Select l to be the k^(th)-order static arithmetic codeword length function L_(k) ^(W) with k^(th)-order transition probability function W(u|u^(k)). The Viterbi algorithm can then be used to find the optimal sequence u^(n):

$\begin{matrix} {u^{n} = {\arg \mspace{11mu} {\min\limits_{v^{n = {{({v_{0},v_{1},\mspace{14mu} \ldots \mspace{14mu},v_{n - 1}})} \in M^{n}}}}\begin{bmatrix} {{n^{- 1}{L_{k}^{W}\left( {v_{0},v_{1},\ldots \mspace{14mu},v_{n - 1}} \right)}} +} \\ {\lambda \; n^{- 1}{p\left( {x^{n},{\beta \left( v^{n} \right)}} \right)}} \end{bmatrix}}}} & (2.4) \end{matrix}$

Fix f. The joint optimization of g, u^(n), and L_(k) ^(W) (or equivalently W(u|u^(k))) can be described

$\begin{matrix} {\min\limits_{g,W}{\min\limits_{u^{n} \in M^{n}}\left\lfloor {{n^{- 1}{L_{k}^{W}\left( u^{n} \right)}} + {\lambda \; n^{- 1}{p\left( {x^{n},{\beta \left( u^{n} \right)}} \right)}}} \right\rfloor}} & (2.5) \end{matrix}$

An alternating algorithm was proposed in [19] to solve the joint optimization problem (2.5). The procedure of this alternating algorithm is as follows:

Step 1: Set t=0. Select an output function g^((o)) and a transition probability function W⁽⁰⁾ satisfying

-   -   W⁽⁰⁾(u|u^(k))>0 for any uεM_(set) and u^(k)εM_(set) ^(k).

Step 2: Fix g^((t)) and W^((t)). Use the Viterbi algorithm to find a sequence (u^(n))^((t))=(u₀ ^((t)), u₁ ^((t)), . . . , u_(n−1) ^((t))) satisfying Equation (2.4) with g replaced by g^((t)) and W by W^((t)).

Step 3: Fix (u^(n))^((t)). The index sequence (u^(n))^((t)) gives rise to the update of transition probability function and output function as

${{W^{({t + 1})}\left( u \middle| u^{k} \right)} = \frac{\left\{ {{{j:u_{j}^{(t)}} = u},{\left( u_{j - k}^{j - 1} \right)^{(t)} = u^{k}},{0 \leq i \leq n}} \right\} }{\left\{ {{{j:\left( u_{j - k}^{j - 1} \right)^{(t)}} = u^{k}},{0 \leq j < n}} \right\} }},{u^{k} \in M_{set}^{k}},{u \in M_{set}}$ and ${{g^{(t)}\left( {s,u} \right)} = \frac{\sum\limits_{s,u}x_{j}}{\left\{ {{{j:s_{i_{j}}} = s},{u_{j}^{(t)} = u},{0 \leq j < n}} \right\} }},{s \in S},{u \in M_{set}}$

where u_(j−k) ^(j−1)=u_(j−k) . . . u_(j−1), s_(i) _(j) , j=0, 1, . . . , n−1, are the states traversed by the trellis decoder (f,g^((t))) in response to (u^(n))^((t)), and Σ_(s,u) is taken over all j satisfying s_(i) _(j) =s and u_(j) ^((t))=u.

Step 4: Repeat steps 2 to 3 for t=0,1, 2, . . . until

${\left\lfloor \begin{matrix} {{n^{- 1}{L_{k}^{W^{(t)}}\left( \left( u^{n} \right)^{(t)} \right)}} +} \\ {\lambda \; n^{- 1}{p\left( {x^{n},{\beta^{(t)}\left( \left( u^{n} \right)^{(t)} \right)}} \right)}} \end{matrix} \right\rfloor - \left\lfloor \begin{matrix} {{n^{- 1}{L_{k}^{W^{({t + 1})}}\left( \left( u^{n} \right)^{({t + 1})} \right)}} +} \\ {\lambda \; n^{- 1}{p\left( {x^{n},{\beta^{({t + 1})}\left( \left( u^{n} \right)^{({t + 1})} \right)}} \right)}} \end{matrix} \right\rfloor} \leq \xi$

where ξ is a prescribed small threshold, and L_(k) ^(W) ^((t)) is the k^(th)-order static arithmetic codeword length function associated with k^(th)-order transition probability function W^((t))(u|u^(k)). Then output g^((t+1)), (u^(n))^((t+1)), and W^((t+1)).

The performance of VRTSE is asymptotically close to the rate-distortion limit, as shown by Theorems 3 and 4 in reference [19]. The experimental results over Gaussian, Laplacian, Gauss-Markov sources show that VRTSE is especially suitable for low-rate coding. To apply VRTSE to color image encoding the following problems must be addressed:

Problem 1: The lossless codeword length function used in VRTSE is a k^(th)-order static arithmetic codeword length function L_(k). On the other hand, in the present example of color image encoding, the lossless codeword length function is the Lempel-ziv codeword length function l_(LZ).

Problem 2: In VRTSE, the initialization step, Step 1, is unspecified. That is, how to select the initial functions g⁽⁰⁾ and W⁽⁰⁾ is left open in VRTSE. This translates, in our color image encoding setting, into how to design an initial color image encoding scheme.

Problem 3: To reduce its computational complexity, the index set M_(set) in VRTSE is often chosen to be binary with M_(set)=2 so that a high order arithmetic codeword length can be used. On the other hand, in color image encoding, the cardinality M is usually relatively large, and could be as large as 256. Therefore, a new way to reduce the computational complexity is needed.

To get around Problem 1, we will upper bound the Lempel-ziv codeword length function l_(LZ). If l_(LZ) is the codeword length function of LZ78, then it follows from the lossless source coding literature (see, for example, [14]) that for any sequence u^(n)=(u₀, u₁, . . . , u_(n−1)),

$\begin{matrix} {{\frac{1}{n}{l_{LZ}\left( u^{n} \right)}} \leq {{r_{k}\left( u^{n} \right)} + {q_{k}\frac{\log \; \log \; n}{\log \; n}}}} & (2.6) \end{matrix}$

where r_(k)(u^(n)) is the k^(th)-order empirical entropy of u^(n) in bits per symbol, q_(k) is a constant depending only on k, and log stands for the logarithm relative to base 2. A similar upper bound is also valid if l_(LZ) is the codeword length function of LZ77. Instead of minimizing

$\frac{1}{n}{l_{LZ}\left( u^{n} \right)}$

subject to a distortion constraint, we will minimize r_(k)(u^(n)) subject to the same distortion constraint in VRTCQ 1. A different upper bound will be used in VRTCQ 2. Problems 2 to 3 are addressed below.

Entropy-Constrained Hierarchical Merging Quantization

According to an aspect of the invention, problem 2 is addressed through an entropy-constrained hierarchical merging quantization (ECHMQ), which provides an initial color image encoding scheme for VRTSE. ECHMQ serves as the first stage, Stage 1, for both VRTCQ 1 and VRTCQ 2.

ECHMQ is hard-decision quantization, which partitions the original N colors into M non-overlapped clusters, finds a reproductive color for each cluster, and determines the reproductive color for each original color regardless of the position of the original color in the 2-dimensional image. It takes advantage of the octree data structure [3] and trades off the rate and distortion by locally minimizing an entropy-constrained cost, which is defined below.

Given an n-pixel color image with a color palette O={o₀, o₁, . . . , o_(N−1)} and desired new color palette size M<N, we use a hard-decision quantizer q to partition the N colors into M clusters C₀, C₁, . . . , C_(M−1) which satisfy, for i≠j, and 0≦i, j<M

C_(i)∩C_(j)≡Ø

C₀∪C₁∪ . . . ∪C_(M−1)≡O  (3.7)

The integer forms of the centroids of clusters constitute the color palette C={c₀, c₁, . . . , c_(M−1)}, and the mapping from an original color to a cluster explicitly maps each pixel to an index. Let u^(n)=(u₀, u₁, . . . , u_(n−1))εM_(set) ^(n) be the index sequence obtained from mapping all pixels to indices. Then the entropy-constrained cost of the quantized image is defined as:

J(q)=R(q)+λD(q)  (3.8)

where λ is a Lagrangian multiplier. In (3.8), D(q) is the total square error

$\begin{matrix} {{D(q)} = {\sum\limits_{j = 0}^{M - 1}{\sum\limits_{o_{k} \in C_{j}}{{F\left( o_{k} \right)}{d\left( {o_{k},c_{j}} \right)}}}}} & (3.9) \end{matrix}$

where F(o_(i)), with 0≦i<N, is the number of occurrences of color o_(i) in the original color image, and d(o_(k),c_(j)) is the square of Euclidean distance between two colors in RGB space, as defined in Equation (1.1). R(q) is the codeword length of the index sequence u^(n). Since the mapping from a color to an index is independent of the color's position in the color image, the first order entropy is used to calculate the codeword length:

$\begin{matrix} {{R(q)} = {\sum\limits_{j = 0}^{M - 1}\left\lfloor {\left( {\sum\limits_{o_{k} \in C_{j}}{F\left( o_{k} \right)}} \right)\log \frac{n}{\sum\limits_{o_{k} \in C_{j}}{F\left( o_{k} \right)}}} \right\rfloor}} & (3.10) \end{matrix}$

The cost function defined in Equation (3.8) is similar to the Lagrangian function defined in entropy-constrained vector quantization (ECVQ) in reference [18]. The main issue is to design a hard-decision quantizer q with a good rate distortion trade-off and low encoding complexity. An octree structure is used to speed up the merging and the cost function defined in Equation (3.8) to trade off the rate and distortion of the quantized image.

Unlike the on-the-fly octree building procedure which scans the color of each pixel and inserts it in the tree [3], we get the histogram of the original color image and build the initial octree once. Referring to FIG. 2, there is illustrated in a graph, an octree 22, which contains all the distinct colors and their occurrences in an original color image. Root node 24, i.e. level 0, includes all the distinct colors in the color image. Since each color in the RGB color space consists of three 8-bit bytes, each of which represents a primary component, the most significant bits of the three bytes determine the position of the color in level 1. As long as more than one color passes a node, that node is an intermediate node 26 and should be further split according to the combination of the less significant RGB bits. The color passing a leaf node 28 is called a color in that leaf node 28, and the color itself is actually the centroid for that leaf node. The distance, in each color component direction, between the centroids of any two leaf sibling nodes at level k, falls into the range of (0,2^(9−k)). Obviously, the larger k is, the more similar those centroid colors are. Note that the octree 22 shown in FIG. 2 is highly unbalanced and asymmetrical for two reasons: first, the number of colors that appear in an ordinary color image is far less than the total number of 2²⁴ colors available in RGB space—see reference [17]; second, a node stops splitting if there is only one color passing it.

Each distinct color o_(i) in the original color image is now put in a distinct leaf node Θ_(i) in the octree. By repeatedly merging two leaf sibling nodes each time, we can reduce the number of leaf nodes from N to M. The integer form of the centroid of each resulting leaf node is a color in the new color palette. Note that after repeated merger of leaf sibling nodes, each leaf node corresponds to a subset of colors in the color palette of the original color image.

Assume O={o₀, o₁, . . . , o_(N−1)} is the color palette of the original color image. Let Θ_(i) and Θ_(j) be two leaf sibling nodes under the parent node Θ, where Θ_(i)={o_(i) ₀ , o_(i) ₁ , . . . , o_(i) _(m−1) }, Θ_(j)={o_(j) ₀ , o_(j) ₁ , . . . , o_(j) _(m−1) }, and Θ_(i)∩Θ_(j)≡Ø. Let c_(i) be the centroid color for Θ_(i), and c_(j) the centroid color for Θ_(j). The number F_(i) of occurrences of the node Θ_(i) is defined as the sum of the number of occurrences of each color in node Θ_(i)

${F_{i}\underset{\underset{\_}{\_}}{\Delta}F_{i_{0}}} + F_{i_{1}} + \ldots + F_{i_{m - 1}}$

where F_(i) _(t) denotes the number of occurrences of the color o_(i) _(t) in the original image. The number F_(j) of occurrences of the node Θ_(j) is calculated in a similar manner:

${F_{j}\underset{\underset{\_}{\_}}{\Delta}F_{j_{0}}} + F_{j_{1}} + \ldots + F_{j_{k - 1}}$

where F_(j) _(t) denotes the number of occurrences of the color o_(j) _(t) in the original image. By merging the two nodes Θ_(i) and Θ_(j) to a new node Θ_(ij), we move all colors in Θ_(i) and Θ_(j) to the new node Θ_(ij). i.e. Θ_(ij)=Θ_(i)∪Θ_(j)={o_(i) ₀ , o_(i) ₁ , . . . , o_(i) _(m−1) , o_(j) ₀ , o_(j) ₁ , . . . , o_(j) _(k−1) }. Accordingly, the number of occurrences of the node Θ_(ij) is F_(ij)=F_(i)+F_(j). Assume that real-valued colors are allowed. The following lemma gives the entropy-constrained cost increment resulting from merging Θ_(i) and Θ_(j) to Θ_(ij).

Lemma 1: By merging nodes Θ_(i) and Θ_(j), the entropy constrained cost is increased by

$\begin{matrix} {{\Delta \; J} = {{\lambda \begin{pmatrix} {{F_{i}{d\left( {c_{i},c_{ij}} \right)}} +} \\ {F_{j}{d\left( {c_{j},c_{ij}} \right)}} \end{pmatrix}} + {F_{ij}\log \frac{n}{F_{ij}}} - {F_{i}\log \frac{n}{F_{i}}} - {F_{j}\log \frac{n}{F_{j}}}}} & (3.11) \end{matrix}$

where c_(ij) is the centroid of the node Θ_(ij), i.e.

$\begin{matrix} {c_{ij} = {\frac{1}{F_{ij}}\left( {{F_{i}c_{i}} + {F_{j}c_{j}}} \right)}} & (3.12) \end{matrix}$

Proof: The minimum total square error is achieved when we reproduce all elements in a cell with the centroid of that cell. This is the centroid condition, S. P. Lloyd, “Least squares quantization in pcm,” IEEE Trans. on Information Theory, no. 28, pp. 127-135, March 1982 (hereinafter “reference [21]”), widely used in quantization methods. In this paper, we use the centroid of a leaf node as the quantization level, i.e. reproduction color, for all colors in that node. By this means, the entropy-constrained cost for each possible merger can be calculated without calculating the difference between the total entropy-constrained cost before the merger, and the total entropy-constrained cost after the merger.

Since

${F_{i}c_{i}} = {\sum\limits_{p = 0}^{m - 1}{F_{i_{p}}o_{i_{p}}}}$ and ${{F_{j}c_{j}} = {\sum\limits_{q = 0}^{k - 1}{F_{j_{q}}o_{j_{q}}}}},$

the centroid of the new node Θ_(ij) is

$\begin{matrix} {c_{ij} = {\frac{1}{{\sum\limits_{p = 0}^{m - 1}F_{i_{p}}} + {\sum\limits_{q = 0}^{n - 1}F_{j_{p}}}}\left( {{\sum\limits_{p = 0}^{m - 1}{F_{i_{p}}o_{i_{p}}}} + {\sum\limits_{q = 0}^{k - 1}{F_{j_{q}}o_{j_{q}}}}} \right)}} \\ {= {\frac{1}{F_{ij}}\left( {{F_{i}c_{i}} + {F_{j}c_{j}}} \right)}} \end{matrix}$

Equation (3.11) for the increased entropy-constrained cost ΔJ can be proved by calculating the increased square error ΔD and increased codeword length ΔR separately. Let D_(Θ) _(i) , denote the total square error caused by using c_(i) as the quantization level for Θ_(i). Then

$D_{\Theta_{i}} = {\sum\limits_{p = 0}^{m - 1}{F_{i_{p}}{{{o_{i_{p}} - c_{i}}}^{2}.}}}$

Similarly, we have

$D_{\Theta_{j}} = {\sum\limits_{q = 0}^{k - 1}{F_{j_{q}}{{o_{j_{q}} - c_{j}}}^{2}}}$ $D_{\Theta_{ij}} = {{\sum\limits_{p = 0}^{m - 1}{F_{i_{p}}{{o_{i_{p}} - c_{ij}}}^{2}}} + {\sum\limits_{q = 0}^{k - 1}{F_{j_{q}}{{{o_{j_{q}} - c_{ij}}}^{2}.}}}}$

and Substituting c_(ij) with the expression in Equation (3.12) and simplifying the expression for D(Θ_(ij)) we get D_(Θ) _(ij) =D_(Θ) _(i) +D_(Θ) _(j) +F_(i)d(c_(i),c_(ij))+F_(j)d(c_(j),c_(ij)). Therefore,

-   -   ΔD=D_(Θ) _(ij) −(D_(Θ) _(i) +D_(Θ) _(j)         )=F_(i)d(c_(i),c_(ij))+F_(j)d(c_(j),c_(ij))

Let R_(Θ) _(i) , denote the total number of bits resulting from entropy coding all pixels with colors in node Θ_(i). Then

$R_{\Theta_{i}} = {F_{i}\log {\frac{n}{F_{i}}.}}$

Similarly, we have

${R_{\Theta_{j}} = {{F_{j}\log \frac{n}{F_{j}}\mspace{14mu} {and}\mspace{14mu} R_{\Theta_{ij}}} = {F_{ij}\log {\frac{n}{F_{ij}}.{Thus}}}}},{{\Delta \; R} = {{{R\left( \Theta_{ij} \right)} - \left( {{R\left( \Theta_{i} \right)} + {R\left( \Theta_{j} \right)}} \right)} = {{F_{ij}\log \frac{n}{F_{ij}}} - {F_{i}\log \frac{n}{F_{i}}} - {F_{j}\log \frac{n}{F_{j}}}}}}$

which, together with ΔD, implies (3.11). This completes the proof of Lemma 1.

Lemma 1 provides rules for merging two leaf sibling nodes. Our purpose at stage 1 is to produce a hard-decision quantizer that will give an efficient trade-off between the rate and distortion of the quantized image. Since the original color palette is finite, one could find a globally optimal hard-decision quantizer by searching through all possible combinations. However, such a method has high computational complexity and hence is not feasible for real time compression. Lemma 1 suggests an alternative—a greedy method to design a tree-structured hard-decision quantizer. Based on the original octree with N leaf nodes, one can repeatedly merge two leaf sibling nodes with the minimum increment of the entropy-constrained cost until M leaf nodes are left. Such a method, dubbed entropy-constrained hierarchical merging quantization (ECHMQ), is fast and gives a reasonably good trade-off between the rate and distortion of the quantized image. The detailed steps of the ECHMQ are as follows:

Step 1: Read the n-pixel original color image X=(x₀, x₁, . . . , x_(n−1)) and get the color palette O={o₀, o₁, . . . , o_(N−1)} and the number of occurrences f_(i) for each color o_(i) where 0≦i<N.

Step 2: Build the octree by inserting each color o_(i) into the tree as a distinct leaf node Θ_(i). And for each leaf node Θ_(i), 0≦i<N, compute its centroid c_(i)=o_(i), TSE D_(Θ) _(i) =0, number of occurrences F_(i)=f_(i), and codeword length

$R_{\Theta_{i}} = {F_{i}\log {\frac{n}{F_{i}}.}}$

Step 3: Let k=N.

Step 4: Compute, for every two leaf sibling nodes Θ_(i) and Θ_(j), the centroid c_(ij) by Equation (3.12) and the increased entropy-constrained cost by Equation (3.11).

Step 5: Choose, among all pairs of leaf sibling nodes, the two leaf sibling nodes Θ_(p) and Θ_(q) that minimize the increased entropy-constrained cost calculated in the previous step. Merge Θ_(p) and Θ_(q) into a new leaf node Θ_(pq) which is equal to the parent node of Θ_(p) and Θ_(q) if Θ_(p) and Θ_(q) are the only siblings under their parent node, and to a new combined leaf node under the parent node of Θ_(p) and Θ_(q) otherwise. Compute the centroid c_(pq) of Θ_(pq),

F _(pq) =F _(p) +F _(q),

D _(Θ) _(pq) =D _(Θ) _(p) +D _(Θ) _(q) +F _(p) d(c _(p) ,c _(pq))+F _(q) d(c _(q) ,c _(pq)),

and

$R_{\Theta_{pq}} = {F_{pq}\log {\frac{n}{F_{pq}}.}}$

Step 6: Remove leaf nodes Θ_(p) and Θ_(q) from the octree.

Step 7: Decrease k by 1.

Step 8: Repeat steps 4 to 7 until k=M. Then assign a distinct index iεM_(set) to each of the remaining M leaf nodes in the final octree. The integer form of the centroid of a leaf node is a distinct color in the new color palette, and all colors in that leaf node are mapped to the index corresponding to that leaf node.

When the desired number of colors is reached, the final entropy-constrained cost for quantizing the original image is

${J = {{J_{N} + {\Delta \; J_{N}} + {\Delta \; J_{N - 1}} + \ldots + {\Delta \; J_{M + 1}}} = {J_{N} + {\sum\limits_{i = N}^{M + 1}{\Delta \; J_{i}}}}}},$

where J_(N) is the cost of the original image with N distinct colors, and ΔJ_(i) is the increased cost when we merge two selected leaf nodes and decrease the number of leaf nodes in the octree from i to i−1. By finding the minimum increased entropy-constrained cost each time when we merge two leaf sibling nodes in the octree, ECHMQ provides a locally optimal way to minimize the entropy-constrained cost.

ECHMQ aims to minimize (locally) the entropy-constrained cost, rather than the pure distortion TSE. Therefore, the rate and distortion of the quantized image are controlled and traded off by the Lagrangian multiplier λ. As λ increases, the average distortion decreases, and the corresponding rate increases. Indeed, −λ can be interpreted as the slope of the resulting rate distortion curve. Thus, in ECHMQ, we have the flexibility to use λ as a trade-off factor to vary the rate and distortion of the quantized image.

Another advantage of ECHMQ is its low computational complexity. To illustrate this, suppose initially we have total 256 leaf nodes which are all located at level 8, under 32 parent nodes at level 7. To decrease the number of leaf nodes to 255, we need to calculate the increased entropy-constrained cost for

${32 \times \frac{8!}{{2!} \times {6!}}} = 896$

pairs of leaf sibling nodes. If the octree structure is not used, we need to calculate the increased cost for

$\frac{256!}{{2!} \times {254!}} = 32640$

pairs, which is basically used by the pairwise clustering in [5]. Rewrite Equation (3.11) as

${\Delta \; J} = {{\lambda {\begin{Bmatrix} {F_{i}{\left\lfloor \begin{matrix} {\left( {r_{c_{i}} - r_{c_{ij}}} \right)^{2} +} \\ {\left( {g_{c_{i}} - g_{c_{ij}}} \right)^{2} +} \\ \left( {b_{c_{i}} - b_{c_{ij}}} \right)^{2} \end{matrix} \right\rfloor++}} \\ {F_{j}\left\lfloor \begin{matrix} {\left( {r_{c_{j}} - r_{c_{ij}}} \right)^{2} +} \\ {\left( {g_{c_{j}} - g_{c_{ij}}} \right)^{2} +} \\ \left( {b_{c_{j}} - b_{c_{ij}}} \right)^{2} \end{matrix} \right\rfloor} \end{Bmatrix}++}F_{ij}\log \frac{n}{F_{ij}}} - \left( {R_{\Theta_{i}} + R_{\Theta_{j}}} \right)}$

we see the calculation of the increased cost for each pair of leaf sibling nodes involves 8 additions, 7 subtractions, 10 multiplications, 1 division, and 1 log operation. Compared with the high computation spent in other methods, such as the TSE-based hierarchical splitting method [2] which employs Jocobi method for each splitting, ECHMQ enjoys very low complexity. Also the palette and the pixel mapping are easily obtained at Step 8; this again compares favorably with other methods in literature, such as those described in references [5] and [6], where a significant amount of computation is involved in palette design and pixel mapping.

If we skip the further optimization described below, the new color palette and pixel mapping obtained at the end of the ECHMQ can be encoded directly by GIF/PNG encoder. To be specific, in what follows, we will use a PNG encoder as the entropy coder. Replacing the PNG encoder with an available GIF encoder, we easily have our output compatible with a GIF decoder.

VRTCQ 1

In this section, we will adopt soft-decision quantization to further jointly optimize the compression rate and distortion of a quantized color image while maintaining compatibility with GIF/PNG decoder. Using the hard-decision quantizer obtained at the end of ECHMQ as an initial color image encoding scheme, we will extend VRTSE to color image encoding, yielding VRTCQ 1.

Let us begin with the VRTSE setting of VRTCQ 1. Since we want to maintain compatibility with GIF/PNG decoder, the output function g can not depend on any state. In other words, the state set S consists of only s₀. In this case, the state transition function ƒ can be dropped, the output function g is simply a mapping from M_(set) to the RGB space, defining the correspondence between indices and colors in the color palette, and the trellis decoder is degraded to β=g. Given the original color image x^(n)=(x₀, x₁, . . . , x_(n−1)), we define for any sequence u^(n)=(u₀, u₁, . . . , u_(n−1))εM_(set) ^(n)

${d\left( {x^{n},{g\left( u^{n} \right)}} \right)} = {\sum\limits_{i = 0}^{n - 1}{d\left( {x_{i},{g\left( u_{i} \right)}} \right)}}$

We will use the upper bound given in (2.6), and minimize r_(k)(u^(n)) subject to a distortion constraint. To be specific, let k=1. However, the procedure described below can be easily extended to any k.

The initial output function g⁽⁰⁾ and transition probability function W⁽⁰⁾ can be derived from the color palette and pixel mapping obtained at the end of ECHMQ. The detailed procedure of VRTCQ 1 is described as follows:

Step 1: Set t=0. Obtain (u^(n))⁽⁰⁾, g⁽⁰⁾ and W⁽⁰⁾ from ECHMQ: (u^(n))⁽⁰⁾=(u₀ ⁽⁰⁾, u₁ ⁽⁰⁾, . . . , u_(n−1) ⁽⁰⁾) is the index sequence of the quantized image resulting from the hard-decision quantizer, g⁽⁰⁾(j), 0≦j<M, is the color, corresponding to index j, in the new color palette obtained at the end of ECHMQ, and

${W^{(0)}\left( {\alpha w} \right)} = \frac{\left\{ {{{i\text{:}\mspace{14mu} u_{i}^{(0)}} = \alpha},{u_{i - 1}^{(0)} = w},{0 \leq i < n}} \right\} }{\left\{ {{{i\text{:}\mspace{14mu} u_{i - 1}^{(0)}} = w},{0 \leq i < n}} \right\} }$

for any αεM_(set) and wεM_(set). Also calculate the initial cost

J⁽⁰⁾ = n⁻¹L₁^(W⁽⁰⁾)((u^(n))⁽⁰⁾) + λ n⁻¹d(x^(n), g⁽⁰⁾((u^(n))⁽⁰⁾))].

Step 2: Fix g^((t)) and W^((t)). Use the Viterbi algorithm to find a sequence (u^(n))^((t+1))=(u₀ ^((t+1)), u₁ ^((t+1)), . . . , u_(n−1) ^((t+1))) satisfying Equation (2.4) with g replaced by g^((t)) and W by W^((t)).

Step 3: Fix (u^(n))^((t+1)). The index sequence (u^(n))^((t+1)) gives rise to the update of transition probability function and output function as

${W^{({t + 1})}\left( {\alpha w} \right)} = \frac{\left\{ {{{i\text{:}\mspace{14mu} u_{i}^{({t + 1})}} = \alpha},{u_{i - 1}^{t + 1}w},{0 \leq i < n}} \right\} }{\left\{ {{{i\text{:}\mspace{14mu} u_{i - 1}^{({t + 1})}} = w},{0 \leq i < n}} \right\} }$

for any αεM_(set) and wεM_(set), and

${g^{({t + 1})}(u)} = \frac{\sum\limits_{u}x_{i}}{\left\{ {{{i\text{:}\mspace{14mu} u_{i}^{({t + 1})}} = u},{0 \leq i < n}} \right\} }$

for any uεM_(set), where Σ_(u) is taken over all i for which u_(i) ^((t+1))=u. Note that x_(i) represents the color of the i^(th) pixel in the original image.

Step 4: Compute the updated cost

J^(t + 1) = n⁻¹L₁^(W(t + 1))((u^(n))^((t + 1))) + λ n⁻¹d(x^(n), g^((t + 1))((u^(n))^((t + 1))))].

Step 5: Repeat Steps 2 to 4 for t=0, 1, 2, . . . : until J^((t))−J^(t+1)≦ξ, where ξ is a prescribed threshold.

Then output g^((t+1)) and (u^(n))^((t+1)).

Step 6: Encode the color palette g^((t+1)) and the index sequence (u^(n))^((t+1)) using the PNG encoder described in [17].

Steps 2 to 6 can be conveniently referred to as Stage 2 of VRTCQ 1. The Viterbi algorithm used here is depicted in a graph shown in FIG. 3. The increased cost from stage to stage is calculated as:

−log W(u_(i)|u_(i−1))+d(x_(i),g(u_(i)))  (4.13)

where s_(i)=u_(i) for any 0≦i<n. To find the survivor path reaching state j at stage i, we need to compare the M accumulated costs, each of which requires 3 additions, 3 subtractions, and multiplications. Therefore the total computational complexity is O(nM²).

The optimality of Stage 2 is demonstrated by Theorem 3 in [19]. Overall, VRTCQ 1 jointly optimizes the rate and distortion of the quantized color image, to some extent, while maintaining compatibility with GIF/PNG decoder. Experiments show that the convergence is reasonably fast; typically, after 2 to 3 iterations, J^((t)) is very close to its limit.

We conclude this section considering the overall computational complexity of VRTCQ 1. In comparison with Stage 2, Stage 1 of VRTCQ 1, i.e., the ECHMQ, has much lower computational complexity. Therefore, the main computational complexity of VRTCQ 1 lies in Stage 2, particularly in the Viterbi algorithm. Since each iteration of the Viterbi algorithm has computational complexity O(nM²), the overall computational complexity of VRTCQ 1 may be inconveniently high for real time compression when M is large. Therefore, it is desirable to reduce computational complexity in the case of large M. This problem is addressed by VRTCQ 2.

VRTCQ 2

To reduce the computational complexity of VRTCQ 1 in the case of large M, we now upper bound the Lempel-Ziv codeword length function in a way different from (2.6). To this end, we define a new information quantity different from the k^(th)-order empirical entropy r_(k)(u^(n)). Let M′ be an integer strictly less than M. Let b(•) be a mapping from M_(set)={0, 1, . . . , M−1} onto M_(set)={0, 1, . . . , M−1}. In terms of b, we partition M_(set) into M′ groups {iεM_(set):b(i)=j}j=0, 1, . . . , M′−1. For any u^(n)=(u₀, u₁, . . . , u_(n−1))εM_(set) ^(n), let

b(u^(n))=(b(u₀), b(u₁), . . . , b(u_(n−1)))

Define

${r\left( {u^{n}{b\left( u^{n} \right)}} \right)}\underset{\underset{\_}{\_}}{\Delta}{\sum\limits_{j = 0}^{M^{\prime} - 1}{\sum\limits_{i = 0}^{M - 1}{{\begin{Bmatrix} {{{t\text{:}0} \leq t < n},} \\ {{u_{t} = i},{{b\left( u_{t} \right)} = j}} \end{Bmatrix}}\log \; \frac{\begin{Bmatrix} {{{t\text{:}0} \leq t < n},} \\ {{b\left( u_{t} \right)} = j} \end{Bmatrix}}{\begin{Bmatrix} {{{t\text{:}0} \leq t < n},} \\ {{u_{t} = i},} \\ {{b\left( u_{t} \right)} = j} \end{Bmatrix}}}}}$

The quantity r(u^(n)|b(u^(n))) is called the conditional empirical entropy of u^(n) given b(u^(n)). Our desired information quantity is defined as

r _(k)*(u ^(n))=r _(k)(b(u ^(n)))+r(u ^(n) |b(u ^(n)))

where r_(k)(b(u^(n))) is the k^(th)-order empirical entropy of b(u^(n)). It is not hard to show that

${r_{k}\left( u^{n} \right)} \leq {{r_{k}^{\star}\left( u^{n} \right)} + {O\left( \frac{\log \; n}{n} \right)}}$

Thus, in view of (2.6), the Lempel-Ziv codeword length function l_(LZ) can also be upper bounded by

$\begin{matrix} {{\frac{1}{n}{l_{LZ}\left( u^{n} \right)}} \leq {{r_{k}^{\star}\left( u^{n} \right)} + {O\left( \frac{\log \; \log \; n}{\log \; n} \right)}}} & (5.14) \end{matrix}$

Instead of minimizing r_(k)(u^(n)) subject to a distortion constraint, we now minimize r_(k)*(u^(n)) subject to a distortion constraint in VRTCQ 2. Similar to the fact that nr_(k)(u^(n)) is the minimum codeword length afforded by all k^(th)-order static arithmetic codeword length functions L_(k) ^(W), nr_(k)*(u^(n)) is also related to codeword length functions. Let W_(S)(s|s^(k)) be a probability transition function from M′_(set) ^(k) to M′_(set) and W_(U)(u|s) a probability transition function from M′_(set) to M_(set). For any u^(n)=(u₀, u₁, . . . , u_(n−1))εM_(set) ^(n) let

$\begin{matrix} {{L_{W_{s}}^{W_{U}}\left( u^{n} \right)} = {- {\sum\limits_{t = 0}^{n - 1}\begin{bmatrix} {{\log \; {W_{S}\left( {{b\left( u_{t} \right)}{{b\left( u_{t - 1} \right)}\mspace{14mu} \ldots \mspace{14mu} {b\left( u_{t - k} \right)}}} \right)}} +} \\ {\log \; {W_{U}\left( {u_{t}{b\left( u_{t} \right)}} \right)}} \end{bmatrix}}}} & (5.15) \end{matrix}$

It is easy to see that L_(W) _(S) ^(W) ^(U) is a codeword length function corresponding to a lossless code via which u^(n) is encoded by first using a k^(th)-order static arithmetic code with transition probability W_(S) to encode b(u^(n)), and then encoding u^(n) conditionally given b(u^(n)). Moreover, it is not hard to show that

${{nr}_{k}^{\star}\left( u^{n} \right)} = {{\min\limits_{W_{s},W_{U}}{L_{W_{s}}^{W_{U}}\left( u^{n} \right)}} + {O\left( {\log \; n} \right)}}$

Accordingly, given the mapping b, the joint optimization problem in VRTCQ 2 becomes

$\begin{matrix} {\min\limits_{g,W_{S},W_{U}}{\min\limits_{u^{n} \in M_{set}^{n}}\left\lfloor {{n^{- 1}{L_{W_{s}}^{W_{U}}\left( u^{n} \right)}} + {\lambda \; n^{- 1}{d\left( {x^{n},{g\left( u^{n} \right)}} \right)}}} \right\rfloor}} & (5.16) \end{matrix}$

To be specific, let k=1. Nonetheless, all arguments and procedures below apply to the general k as well. Given g, W_(S), and W_(U), the inner minimization in (5.16) can be solved by the Viterbi algorithm with complexity of O(nM′²) instead of O(nM²). To see this is the case, note that in view of (5.15), the cost increases, each time as t increases, by

−log W_(S)(b(u_(t))|b(u_(t−1)))−log W_(U)(u_(t)|b(u_(t)))+λd(x_(t),g(u_(t)))  (5.17)

In (5.17), only the first term relies on the past through b(u_(t−1)). Therefore, one can build a trellis with state set SΔM′_(set) and full connection between states of two consecutive stages, and then run the Viterbi algorithm on the trellis to solve the inner minimization problem. Before running the Viterbi algorithm, we compute the minimum sub-cost

${c\left( {s,x} \right)}\underset{\underset{\_}{\_}}{\Delta}{\min\limits_{u \in {\{{{i:{0 \leq i < M}},{{b{(i)}} = s}}\}}}\left\lbrack {{{- \log}\; {W_{U}\left( {us} \right)}} + {\lambda \; {d\left( {x,{g(u)}} \right)}}} \right\rbrack}$

for every combination of (s,x), where sεM′_(set) and xεO. The minimum sub-cost and the corresponding color index u achieving the minimum sub-cost for that pair (s,x) are kept in a look-up table. The cost over the transition from a state s_(t−1)εM′_(set) at Stage t−1 of the trellis to a state s_(t) at Stage t of the trellis is −log W_(S)(s_(t)|s_(t−1))+c(s_(t),x_(t)). Given the original image x^(n)=(x₀, x₁, . . . , x_(n−1)), if s^(n)=(s₀, s₁, . . . , s_(n−1))εM′_(set) ^(n) is the optimal path through the trellis, then u^(n)=(u₀, u₁, . . . , u_(n−1)), where u_(t)ε{i:0≦i<M,b(i)=s_(t)} achieves the minimum cost c(s_(t),x_(t)), t=0, 1, . . . , n−1, is the optimal index sequence achieving the inner minimization in (5.16).

Similar to VRTCQ 1, VRTCQ 2 solves the joint optimization problem (5.16) in an iterative manner. Stage 1 of VRTCQ 2 determines the mapping b, and provides the initial output function g⁽⁰⁾ and transition probability functions W_(U) ⁽⁰⁾ and W_(S) ⁽⁰⁾. Stage 2 of VRTCQ 2 then uses an alternative procedure to solve the minimization problem. The detailed procedures of VRTCQ 2 are described as follows.

A. Procedure of Stage 1

Step 1: Run ECHMQ on the original image to get an octree T_(M) with M leaf nodes, its color palette of size M, and the corresponding hard-decision pixel mapping.

Step 2: Based on T_(M), repeat Steps 4 to 7 of the ECHMQ until M′ leaf nodes are remaining.

Step 3: Determine the mapping b from the octree T_(M) to the octree T_(M′) with M′ leaf nodes obtained in Step 2, which is a subtree of T_(M). In particular, b(i)=j, iεM_(set) and jεM′_(set), if and only if the i^(th) leaf node of T_(M) lies in the subtree of T_(M) rooted at the jth leaf node of T_(M′).

B. Procedure of Stage 2

Step 1: Set t=0. Obtain b, (u^(n))⁽⁰⁾, (s^(n))⁽⁰⁾, g⁽⁰⁾, W_(U) ⁽⁰⁾, and W_(S) ⁽⁰⁾ from Stage 1 of the VRTCQ 2, where (u^(n))⁽⁰⁾=(u₀ ⁽⁰⁾, u₁ ⁽⁰⁾, . . . , u_(n−1) ⁽⁰⁾) is the index sequence resulting from the hard decision pixel mapping, (s^(n))⁽⁰⁾=(s₀ ⁽⁰⁾, s₁ ⁽⁰⁾, . . . , s_(n−1) ⁽⁰⁾)=b((u^(n))⁽⁰⁾,g⁽⁰⁾(u)) with 0≦u<M, is the color, corresponding to the index u, in the new color palette obtained in Step 1 of Stage 1,

$\begin{matrix} {{{W_{U}^{(0)}\left( {us} \right)} = \frac{\left\{ {{{i\text{:}u_{i}^{(0)}} = u},{s_{i}^{(0)} = s},{0 \leq i < n}} \right\} }{\left\{ {{{i\text{:}s_{i}} = s},{0 \leq i < n}} \right\} }},{u \in M_{set}},{s \in M_{set}^{\prime}}} & \; \\ {and} & \; \\ {{{W_{S}^{(0)}\left( {\alpha w} \right)} = \frac{\begin{Bmatrix} {{{i\text{:}s_{i - 1}} = w},{s_{i} = \alpha},} \\ {0 \leq i < n} \end{Bmatrix}}{\left\{ {{{i\text{:}s_{i - 1}} = w},{0 \leq i < n}} \right\} }},{\alpha \in M_{set}^{\prime}},{w \in M_{set}^{\prime}}} & \; \end{matrix}$

Also compute the initial cost

J⁽⁰⁾ = n⁻¹L_(W_(s)⁽⁰⁾)^(W_(U)⁽⁰⁾)((u^(n))⁽⁰⁾) + λ n⁻¹d(x^(n), g⁽⁰⁾((u^(n))⁽⁰⁾))

Step 2: Fix g^((t)) and W_(U) ^((t)). Build the look-up table. For each pair of (s,x), where sεM′_(set) and xεO, compute the minimum sub-cost

${c^{(t)}\left( {s,x} \right)} = {\min\limits_{u \in {\{{{i:{0 \leq i < M}},{{b{(i)}} = s}}\}}}\left\lfloor {{{- \log}\; W_{U}^{(t)}{v\left( {us} \right)}} + {\lambda \; {d\left( {x,{g^{(t)}(u)}} \right)}}} \right\rfloor}$

and record the color index uε{i:0≦i<M,b(i)=s} which achieves c^((t))(s,x).

Step 3: Fix g^((t)), W_(U) ^((t)), and W_(S) ^((t)). Use the Viterbi algorithm to find the optimal path through the trellis (S^(n))^((t+1))=(s₀ ^((t+1)), s₁ ^((t+1)), . . . , s_(n−1) ^((t+1))), which, together with b and the look-up table, determines the optimal index sequence (u^(n))^((t+1))=(u₀ ^((t+1)), u₁ ^((t+1)), . . . , u_(n−1) ^((t+1))) achieving the inner minimization in (5.16) with g replaced by g^((t)), W_(U) by W_(U) ^((t)), and W_(S) by W_(S) ^((t)).

Step 4: Fix (u^(n))^((t+1)) and (s^(n))^((n+1)). These two sequences give rise to the update of transition probability functions and output function as

${{W_{U}^{({t + 1})}\left( {us} \right)} = \frac{\begin{Bmatrix} {{{i\text{:}u_{i}^{({t + 1})}} = u},{s_{i}^{({t + 1})} = s},} \\ {0 \leq i < n} \end{Bmatrix}}{\left\{ {{{i\text{:}s_{i}^{({t + 1})}} = w},{0 \leq i < n}} \right\} }},{u \in M_{set}},{s \in M_{set}^{\prime}},{{W_{S}^{({t + 1})}\left( {\alpha w} \right)} = \frac{\begin{Bmatrix} {{{i\text{:}s_{i - 1}^{({t + 1})}} = w},{s_{i}^{({t + 1})} = \alpha},} \\ {0 \leq i < n} \end{Bmatrix}}{\left\{ {{{i\text{:}s_{i - 1}^{({t + 1})}} = w},{0 \leq i < n}} \right\} }},{\alpha \in M^{\prime}},{w \in M^{\prime}},{and}$ ${{g^{({t + 1})}(u)} = \frac{\sum\limits_{u}x_{i}}{\left\{ {{{i\text{:}u_{i}^{({t + 1})}} = u},{0 \leq i < n}} \right\} }},{u \in M}$

where Σ_(u) is taken over all i for which u_(i) ^((t+1))=u.

Step 5: Compute the updated cost

J^((t + 1)) = n⁻¹L_(W_(S)^((t + 1)))^(W_(U)^((t + 1)))((u^(n))^((t + 1))) + λ n⁻¹d(x^(n), g^((t + 1))((u^(n))^((t + 1))))

Step 6: Repeat Steps 2 to 5 for t=0, 1, 2, . . . until J^((t))−J^((t+1))≦ξ, where ξ is a prescribed threshold.

Then output g^((t+1)) and (u^(n))^((t+1)).

Step 7: Encode the color palette g^((t+1)) and the index sequence (u^(n))^((t+1)) by the PNG encoder from [17].

The Viterbi algorithm used in Step 3 is depicted in the graph of FIG. 4. In the graph, each circle represents a group, and the black dots within a circle represent all color indices uεM_(set) in the group.

Similar to VRTCQ 1, the major computational complexity of VRTCQ 2 is still in its Stage 2. Although in comparison with Stage 2 of VRTCQ 1, Stage 2 of VRTCQ 2 has an extra step, Step 2, this step is not computationally intensive. Indeed, its computational complexity is O(NM), which does not depend on the size n of the original image and hence is negligible as compared to the complexity of the Viterbi algorithm when n is large. The Viterbi algorithm in Step 3 of Stage 2 of VRTCQ 2 now has O(nM′²) computational complexity, which compares favorably with the O(nM²) computational complexity of the Viterbi algorithm used in VRTCQ 1. Thus when M′<<M, VRTCQ 2 will be much faster than VRTCQ 1. In addition, once M′ is fixed, the computational complexity of VRTCQ 2 is more or less independent of M. This makes VRTCQ 2 attractive for color rich images. The price paid in VRTCQ 2 is the slight loss of compression performance in terms of the trade-off between the compression rate and distortion since a loose bound is used to upper bound the Lempel-Ziv codeword length function.

Referring to FIG. 5, there is illustrated in a block diagram, the CPU 16 of the computer system 10 of FIG. 1. As shown, the CPU 16 includes a hard-decision module 40 and a soft-decision module 42. The hard-decision module 40 provides ECHMQ as described above. The soft-decision module 42 provides both VRTCQ 1 and VRTCQ 2 as described above.

As described above, the hard-decision module 40 comprises a node creation sub-module for building an octree structure, a node merging sub-module for selecting and merging leaf nodes, and a cost calculation sub-module for calculating, for potential mergers of pairs of leaf nodes, the entropy-constrained cost increment for each such merger. Similar to the hard-decision module 40, the soft-decision module 42 includes a cost calculation sub-module for determining the incremental reduction in cost after each iteration of soft-decision optimization by the soft-decision module 42.

Other variations and modifications of the invention are possible. For example, as described above, ECHMQ may be used on its own, without using VRTCQ on other soft-decision optimization, to provide a hard decision pixel mapping. Alternatively, VRTCQ may be used without using ECHMQ to provide the initial hard decision pixel mapping. Instead, some other initial hard decision procedure may be provided. Further, other soft decision optimization methods may be used in combination with ECHMQ instead of VRTCQ. Further, while the foregoing description is largely directed to how to jointly address both quantization distortion and compression rate while maintaining low computational complexity and compatibility with standard decoders, such as, for example, the GIF/PNG decoder, it will be apparent to those of skill in the art that both ECHMQ and VRTCQ may be applied to the compression of color image data in other contexts as well. All such modifications or variations are believed to be within the sphere and scope of the invention as defined by the claims appended hereto. 

1. A method for creating, from a digitized color image with N distinct colors using a data processing system, a tree-structured partitioning of all pixels in the digitized color image into M disjoint clusters, wherein M is less than or equal to N, each color in the N distinct colors is digitally represented in a color palette by a plurality of P-bit bytes, and the P-bits in each P-bit byte are ordered from most significant to least significant, the method comprising: (a) providing a root node comprising each color in the N distinct colors; (b) providing a plurality of sibling nodes at a first level of nodes, wherein each sibling node in the plurality of sibling nodes is linked to the root node, and each color in the N distinct colors is allocated by the data processing system to a sibling node in the first level of nodes based on a value of a first bit in each P-bit byte in the plurality of P-bit bytes; (c) for each node in a k^(th) level of nodes, that node at the k^(th) level comprising more than one color in the N distinct colors, providing a distinct plurality of sibling nodes at a (k+1)^(th) level of nodes, wherein each sibling node in the distinct plurality of sibling nodes at the (k+1)^(th) level is linked to that node at the k^(th) level, and each color in that node at the k^(th) level is allocated by the data processing system to a sibling node in the distinct plurality of sibling nodes at the (k+1)^(th) level based on a value of a (k+1)^(th) bit in each P-bit byte in the plurality of P-bit bytes for that color, until each color in the N distinct colors is allocated to a distinct leaf node comprising that color alone; and (d) for each distinct plurality of sibling nodes, and for each pair of leaf sibling nodes included in a distinct plurality of sibling nodes, determining an associated entropy-constrained cost increment to determine a plurality of entropy-constrained cost increments including the associated entropy-constrained cost increment for each pair of leaf sibling nodes, and then selecting and merging pairs of leaf sibling nodes based on the plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 2. The method as defined in claim 1 wherein (d) comprises, after merging a pair of leaf sibling nodes, determining an associated entropy-constrained cost increment for each remaining pair of leaf sibling nodes to determine a new plurality of entropy-constrained cost increments, and repeatedly selecting and merging pairs of leaf sibling nodes based on the new plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 3. The method as defined in claim 1 wherein (d) comprises repeatedly selecting and merging pairs of leaf sibling nodes determined to have a minimum entropy-constrained cost increment of the plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 4. The method as defined in claim 3 wherein (d) comprises calculating the minimum entropy-constrained cost increment without calculating a difference between a pre-merger total entropy-constrained cost and a post-merger total entropy-constrained cost.
 5. The method as defined in claim 1 wherein the plurality of P-bit bytes for each color in the N distinct colors comprises a P-bit byte for each primary color in a plurality of primary colors.
 6. The method as defined in claim 5 wherein the plurality of primary colors comprises red, green and blue.
 7. The method as defined in claim 1 further comprising creating a new digitized color image with M distinct colors, wherein there is a one-to-one correspondence between the M distinct colors and the M leaf nodes left after completion of (d).
 8. A data processing system for creating, from a digitized color image with N distinct colors, a tree-structured partitioning of all pixels in the digitized color image into M disjoint clusters, wherein M is less than or equal to N, each color in the N distinct colors is digitally represented in a color palette by a plurality of P-bit bytes, and the P-bits in each P-bit byte are ordered from most significant to least significant, the data processing system comprising: (a) node-creation means for (i) providing a root node comprising each color in the N distinct colors; (ii) providing a plurality of sibling nodes at a first level of nodes, wherein each sibling node in the plurality of sibling nodes is linked to the root node, and each color in the N distinct colors is allocated to a sibling node in the first level nodes based on a value of a first bit in each P-bit byte in the plurality of P-bit bytes; and (iii) for each node in a k^(th) level of nodes, that node at the k^(th) level comprising more than one color in the N distinct colors, providing a distinct plurality of sibling nodes at a (k+1)^(th) level of nodes, wherein each sibling node in the distinct plurality of sibling nodes at the (k+1)^(th) level is linked to that node at the k^(th) level, and each color in that node at the k^(th) level is allocated to a sibling node in the distinct plurality of sibling nodes at the (k+1)^(th) level based on a value of a (k+1)^(th) bit in each P-bit byte in the plurality of P-bit bytes for that color, until each color in the N distinct colors is allocated to a distinct leaf node comprising that color alone; (b) cost calculation means for, for each distinct plurality of sibling nodes, and for each pair of leaf sibling nodes included in a distinct plurality of sibling nodes, determining an associated entropy-constrained cost increment to determine a plurality of entropy-constrained cost increments including the associated entropy-constrained cost increment for each pair of leaf sibling nodes; and (c) node merging means linked to the cost calculation means for selecting and merging pairs of leaf sibling nodes based on the plurality of entropy-constrained cost increments determined by the cost calculation means, until there are only M leaf nodes left.
 9. The data processing system as defined in claim 8 wherein the cost calculation means is operable to, after merging a pair of leaf sibling nodes, determine an associated entropy-constrained cost increment for each remaining pair of leaf sibling nodes to determine a new plurality of entropy-constrained cost increments, and the node merging means is operable to repeatedly select and merge pairs of leaf sibling nodes based on the new plurality of entropy-constrained cost increments determined by the cost calculation means, until there are only M leaf nodes left.
 10. The data processing system as defined in claim 8 wherein the node merging means is operable to repeatedly select and merge pairs of leaf sibling nodes determined by the cost calculation means to have a minimum entropy-constrained cost increment of the plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 11. The data processing system as defined in claim 10 wherein the cost calculation means is operable to calculate the minimum entropy-constrained cost increment without calculating a difference between a pre-merger total entropy-constrained cost and a post-merger total entropy-constrained cost.
 12. The data processing system as defined in claim 8 wherein the plurality of P-bit bytes for each color in the N distinct colors comprises a P-bit byte for each primary color in a plurality of primary colors.
 13. The data processing system as defined in claim 12 wherein the plurality of primary colors comprises red, green and blue.
 14. The data processing system as defined in claim 8 further comprising reproduction means for creating a new digitized color image with M distinct colors, wherein there is a one-to-one correspondence between the M distinct colors and the M leaf nodes left after selection and merger by the node merging means.
 15. A computer program product for use on a computer system to create, from a digitized color image with N distinct colors, a tree-structured partitioning of all pixels in the digitized color image into M disjoint clusters, wherein M is less than or equal to N, each color in the N distinct colors is digitally represented in a color palette by a plurality of P-bit bytes, and the P-bits in each P-bit byte are ordered from most significant to least significant, the computer program product comprising: a recording medium; instructions recorded on the recording medium for instructing the computer system, the instructions for: (a) providing a root node comprising each color in the N distinct colors; (b) providing a plurality of sibling nodes at a first level of nodes, wherein each sibling node in the plurality of sibling nodes is linked to the root node, and each color in the N distinct colors is allocated by the computer system to a sibling node in the first level of nodes based on a value of a first bit in each P-bit byte in the plurality of P-bit bytes; (c) for each node in a k^(th) level of nodes, that node at the k^(th) level comprising more than one color in the N distinct colors, providing a distinct plurality of sibling nodes at a (k+1)^(th) level of nodes, wherein each sibling node in the distinct plurality of sibling nodes at the (k+1)^(th) level is linked to that node at the k^(th) level, and each color in that node at the k^(th) level is allocated by the computer system to a sibling node in the distinct plurality of sibling nodes at the (k+1)^(th) level based on a value of a (k+1)^(th) bit in each P-bit byte in the plurality of P-bit bytes for that color, until each color in the N distinct colors is allocated to a distinct leaf node comprising that color alone; and (d) for each distinct plurality of sibling nodes, and for each pair of leaf sibling nodes included in a distinct plurality of sibling nodes, determining an associated entropy-constrained cost increment to determine a plurality of entropy-constrained cost increments including the associated entropy-constrained cost increment for each pair of leaf sibling nodes, and then selecting and merging pairs of leaf sibling nodes based on the plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 16. The computer program product as defined in claim 15 wherein (d) comprises, after merging a pair of leaf sibling nodes, determining an associated entropy-constrained cost increment for each remaining pair of leaf sibling nodes to determine a new plurality of entropy-constrained cost increments, and repeatedly selecting and merging pairs of leaf sibling Anodes based on the new plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 17. The computer program product as defined in claim 15 wherein (d) comprises repeatedly selecting and merging pairs of leaf sibling nodes determined to have a minimum entropy-constrained cost increment of the plurality of entropy-constrained cost increments, until there are only M leaf nodes left.
 18. The computer program product as defined in claim 15 wherein (d) comprises calculating the minimum entropy-constrained cost increment without calculating a difference between a pre-merger total entropy-constrained cost and a post-merger total entropy-constrained cost.
 19. The computer program product as defined in claim 15 wherein the plurality of P-bit bytes for each color in the N distinct colors comprises a P-bit byte for each primary color in a plurality of primary colors.
 20. The computer program product as defined in claim 19 wherein the plurality of primary colors comprises red, green and blue.
 21. The computer program product as defined in claim 15 wherein the instructions are further for creating a new digitized color image with M distinct colors, wherein there is a one-to-one correspondence between the M distinct colors and the M leaf nodes left after completion of (d). 